binary chop造句

Stated more simply the logarithmic measure of variety represents the minimum number of choices ( by binary chop ) needed to resolve uncertainty.
However, compilers are not as intelligent as humans and cannot have a deep knowledge of'context', believing that a range of possible search key integer values such as 1, 2, 4, 6, 7, 20, 23, 40, 42, 50 & 1000 would generate a branch table with an excessively large number of empty entries ( 900 + ) for very little advantage . ( A good optimizing compiler may then presort the values and generate code for a binary chop search, as a'second best'option . ) In fact, the application may be highly " time critical " and memory requirement may not really be an issue at all.
It's difficult to find binary chop in a sentence. 用binary chop造句挺难的